Arithmetic complexity of the predicate logics of certain complete arithmetic theories
نویسندگان
چکیده
منابع مشابه
Arithmetic Complexity of Certain Linear Transformations
We obtain order-sharp quadratic and slightly higher estimates of the computational complexity of certain linear transformations (binomial, Stirling, Lah, Gauss, Serpiński, Sylvester) in the basis {x+ y} ∪ {ax : |a| ≤ C} consisting of the operations of addition and inner multiplication by a bounded constant as well as upper bounds O(n log n) for the computational complexity in the basis {ax+ by ...
متن کاملWeak Theories of Arithmetic for Computational Complexity: A Gentle Introduction
In this talk we will discuss about proof-theoretic approaches to computational complexity in terms of weak theories of arithmetic as known as theories of bounded arithmetic, which was initiated by Samuel Buss. We will start with classical facts on primitive recursive functions, and then go into discussion about polynomial time functions and polynomial space functions, including a recent challen...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولDiophantine undecidable theories of arithmetic
1 Diophantine undecidability Let T be a theory in the usual rst-order language of arithmetic L A (with non-logical symbols 0; 1; +; ; <) extending PA ? , the theory of the nonnegative parts of discretely ordered rings. I shall make use of the usual classes of L A-formulas deened in terms of quantiier complexity, 9 1 1 is the set of L A-formulas of the form 9 x (x; y) with quantiier-free, and 1 ...
متن کاملThe arithmetic of certain cubic function fields
In this paper, we discuss the properties of curves of the form y3 = f(x) over a given field K of characteristic different from 3. If f(x) satisfies certain properties, then the Jacobian of such a curve is isomorphic to the ideal class group of the maximal order in the corresponding function field. We seek to make this connection concrete and then use it to develop an explicit arithmetic for the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2001
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(01)00061-6